Parameterized Metareasoning in Membership Equational Logic
نویسندگان
چکیده
Basin, Clavel, and Meseguer showed in [1] that membership equational logic is a good metalogical framework because of its initial models and support of reflective reasoning. A development and an application of those ideas was presented later in [4]. Here we further extend the metalogical reasoning principles proposed there to consider classes of parameterized theories and apply this reflective methodology to the proof of different parameterized versions of the deduction theorem for minimal logic of implication.
منابع مشابه
Speciication and Proof in Membership Equational Logic
This paper is part of a long term eeort to increase expres-siveness of algebraic speciication languages while at the same time having a simple semantic basis on which eecient execution by rewriting and powerful theorem-proving tools can be based. In particular, our rewriting techniques provide semantic foundations for Maude's functional sublanguage, where they have been eeciently implemented. M...
متن کاملSpecification and Proof in Membership Equational Logic
Abs t rac t This paper is part of a long-term effort to increase expressiveness of algebraic specification languages while at the same time having a simple semantic basis on which efficient execution by rewriting and powerful theorem-proving tools can be based. In particular, our rewriting techniques provide semantic foundations for Maude's functional sublanguage, where they have been efficient...
متن کاملMaude: Speciication and Programming in Rewriting Logic ?
Maude is a high-level language and a high-performance system supporting exe-cutable speciication and declarative programming in rewriting logic. Since rewriting logic contains equational logic, Maude also supports equational speciication and programming in its sublanguage of functional modules and theories. The underlying equational logic chosen for Maude is membership equational logic, that ha...
متن کاملReflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic
We show that the generalized variant of formal systems where the underlying equational specifications are membership equational theories, and where the rules are conditional and can have equations, memberships and rewrites in the conditions is reflective. We also show that membership equational logic, many-sorted equational logic, and Horn logic with equality are likewise reflective. These resu...
متن کاملFormalizing and Proving Semantic Relations between Specifications by Reflection
This work contains both a theoretical development and a novel application of ideas introduced in [1] for using reflection in formal metareasoning. From the theoretical side, we extend the metareasoning principles proposed in [1] to cover the case of metatheorems about equational theories which are unrelated by the inclusion relation. From the practical side, we apply the newly introduced metare...
متن کامل